Digitization of Non-Regular Shapes

نویسنده

  • Peer Stelldinger
چکیده

Only the very restricted class of r-regular shapes is proven not to change topology during digitization. Such shapes have a limited boundary curvature and cannot have corners. In this paper it is shown, how a much wider class of shapes, for which the morphological open-close and the close-open-operator with an r-disc lead to the same result, can be digitized correctly in a topological sense by using an additional repairing step. It is also shown that this class is very general and includes several commonly used shape descriptions. The repairing step is easy to compute and does not change as much pixels as a preprocessing regularization step. The results are applicable for arbitrary, even irregular, sampling grids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Digitization of non-regular shapes in arbitrary dimensions

The preservation of topological properties during digitization is a hard problem in 3 and higher dimensions. Only for the very restricted class of r-regular shapes it is known that the connectivity and inclusion properties of shape components do not change. In a previous paper it was shown for the 2D case, how a much wider class of shapes, for which the morphological open-close and the close-op...

متن کامل

Shape Preserving Digitization of Binary Images After Blurring

Topology is a fundamental property of shapes in pictures. Since the input for any image analysis algorithm is a digital image, which does not need to have the same topological characteristics as the imaged real world, it is important to know, which shapes can be digitized without topological changes. Most existing approaches do not take into account the unavoidable blurring in real image acquis...

متن کامل

Revisiting Digitization, Robustness, and Decidability for Timed Automata

We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to discrete time, but are applicable only when the implementation is closed under digitization and the specification is closed under inverse digitization. We show that, for timed automata, the former (whether the implement...

متن کامل

Ambiguous Digitizations by Dilation

This article deals with ambiguous surface digitizations by dilation in n-dimensional space. The digitization of a sufficiently regular surface is separating but not necessarily minimal. We will determine conditions under which the supercover and the grid intersection digitizations are discrete surfaces. It will also be proven that non-overlapping domains do not solve the problem of simple point...

متن کامل

Connectivity preserving digitization of blurred binary images in 2D and 3D

Connectivity and neighborhood are fundamental topological properties of objects in pictures. Since the input for any image analysis algorithm is a digital image, which does not need to have the same topological characteristics as the imaged real world, it is important to know, which shapes can be digitized without change of such topological properties. Most existing approaches do not take into ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005